\hypertarget{edge__map_8hpp}{\section{include/edge\-\_\-map.hpp \-File \-Reference}
\label{edge__map_8hpp}\index{include/edge\-\_\-map.\-hpp@{include/edge\-\_\-map.\-hpp}}
}


\-Class that maps edges of a graph. \-Let $ G=\{V,E\} $ be a $ d $ -\/regular graph with self-\/loops. \-Then, let $ v \in V $ and $ e \in E $. \-We can label each edge $ e$ with two indices\-: $ v,k $ where $ k\in \{0,1,2,..,d-1\}$. $ e \to e(v,k)$.  


{\ttfamily \#include $<$map$>$}\*
{\ttfamily \#include $<$set$>$}\*
{\ttfamily \#include $<$utility$>$}\*
{\ttfamily \#include $<$iostream$>$}\*
\-Include dependency graph for edge\-\_\-map.\-hpp\-:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=292pt]{edge__map_8hpp__incl}
\end{center}
\end{figure}
\subsection*{\-Classes}
\begin{DoxyCompactItemize}
\item 
class \hyperlink{classedge__map}{edge\-\_\-map}
\end{DoxyCompactItemize}
\subsection*{\-Typedefs}
\begin{DoxyCompactItemize}
\item 
typedef std\-::pair$<$ int, int $>$ \hyperlink{edge__map_8hpp_a56959bcbb72b107f66754176e93b2094}{intpair}
\end{DoxyCompactItemize}


\subsection{\-Detailed \-Description}
\-Class that maps edges of a graph. \-Let $ G=\{V,E\} $ be a $ d $ -\/regular graph with self-\/loops. \-Then, let $ v \in V $ and $ e \in E $. \-We can label each edge $ e$ with two indices\-: $ v,k $ where $ k\in \{0,1,2,..,d-1\}$. $ e \to e(v,k)$. \begin{DoxyAuthor}{\-Author}
\-Kimmo \-Luoma $<$kimmo$>$ 
\end{DoxyAuthor}
\begin{DoxyDate}{\-Date}
\-Thu \-Sep 27 16\-:03\-:53 2012 
\end{DoxyDate}


\subsection{\-Typedef \-Documentation}
\hypertarget{edge__map_8hpp_a56959bcbb72b107f66754176e93b2094}{\index{edge\-\_\-map.\-hpp@{edge\-\_\-map.\-hpp}!intpair@{intpair}}
\index{intpair@{intpair}!edge_map.hpp@{edge\-\_\-map.\-hpp}}
\subsubsection[{intpair}]{\setlength{\rightskip}{0pt plus 5cm}typedef std\-::pair$<$int,int$>$ {\bf intpair}}}\label{edge__map_8hpp_a56959bcbb72b107f66754176e93b2094}
std\-::pair of intergers 